Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

On the maximum number of edges in a hypergraph with a unique perfect matchingBAL, Deepak; DUDEK, Andrzej; YILMA, Zelealem B et al.Discrete mathematics. 2011, Vol 311, Num 21, pp 2577-2580, issn 0012-365X, 4 p.Article

Characterizing minimally n-extendable bipartite graphsDINGJUN LOU.Discrete mathematics. 2008, Vol 308, Num 11, pp 2269-2272, issn 0012-365X, 4 p.Article

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREEHAN, Hiêp; PERSON, Yury; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 732-748, issn 0895-4801, 17 p.Article

Connections between Wiener index and matchingsWEIGEN YAN; YEH, Yeong-Nan.Journal of mathematical chemistry. 2006, Vol 39, Num 2, pp 389-399, issn 0259-9791, 11 p.Article

Double bonds in fused hexacyclic systemsKARIMI, Sasan; LEWINTER, Marty; STAUFFER, Julian et al.Journal of mathematical chemistry. 2003, Vol 34, Num 3-4, pp 297-301, issn 0259-9791, 5 p.Article

A characterization of (2γ, γ_p)-treesXINMIN HOU.Discrete mathematics. 2008, Vol 308, Num 15, pp 3420-3426, issn 0012-365X, 7 p.Article

A quadratic identity for the number of perfect matchings of plane graphsWEIGEN YAN; FUJI ZHANG.Theoretical computer science. 2008, Vol 409, Num 3, pp 405-410, issn 0304-3975, 6 p.Article

A note on minimal matching covered graphsMKRTCHYAN, V. V.Discrete mathematics. 2006, Vol 306, Num 4, pp 452-455, issn 0012-365X, 4 p.Article

Characterizations of trees with equal paired and double domination numbersBLIDIA, Mostafa; CHELLALI, Mustapha; HAYNES, Teresa W et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1840-1845, issn 0012-365X, 6 p.Article

On the hardness of graph isomorphismTORAN, Jacobo.SIAM journal on computing (Print). 2004, Vol 33, Num 5, pp 1093-1108, issn 0097-5397, 16 p.Article

A lower bound for approximating the geometric minimum weight matchingDAS, G; SMID, M.Information processing letters. 2000, Vol 74, Num 5-6, pp 253-255, issn 0020-0190Article

On upper bounds for parameters related to the construction of special maximum matchingsKHOJABAGHYAN, Artur; MKRTCHYAN, Vahan V.Discrete mathematics. 2012, Vol 312, Num 2, pp 213-220, issn 0012-365X, 8 p.Article

1-factor covers of regular graphsBELCASTRO, Sarah-Marie; YOUNG, Michael.Discrete applied mathematics. 2011, Vol 159, Num 5, pp 281-287, issn 0166-218X, 7 p.Article

Strong matching preclusionPARK, Jung-Heum; IHM, Insung.Theoretical computer science. 2011, Vol 412, Num 45, pp 6409-6419, issn 0304-3975, 11 p.Article

2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenesHEPING ZHANG; SAIHUA LIU.Discrete applied mathematics. 2010, Vol 158, Num 14, pp 1559-1569, issn 0166-218X, 11 p.Article

A NEW LOWER BOUND ON THE NUMBER OF PERFECT MATCHINGS IN CUBIC GRAPHSKRAL, Daniel; SERENI, Jean-Sébastien; STIEBITZ, Michael et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 3, pp 1465-1483, issn 0895-4801, 19 p.Article

Edge-deletable IM-extendable graphs with minimum number of edgesXIUMEI WANG; JINJIANG YUAN; SUJING ZHOU et al.Discrete mathematics. 2009, Vol 309, Num 16, pp 5242-5247, issn 0012-365X, 6 p.Article

Extremal fullerene graphs with the maximum Clar numberDONG YE; HEPING ZHANG.Discrete applied mathematics. 2009, Vol 157, Num 14, pp 3152-3173, issn 0166-218X, 22 p.Article

More on almost self-complementary graphsFRANCETIC, Nevena; SAJNA, Mateja.Discrete mathematics. 2009, Vol 309, Num 10, pp 3106-3112, issn 0012-365X, 7 p.Article

An Ore-type condition for arbitrarily vertex decomposable graphsMARCZYK, Antoni.Discrete mathematics. 2009, Vol 309, Num 11, pp 3588-3594, issn 0012-365X, 7 p.Article

A characterization of maximal non-k-factor-critical graphsANANCHUEN, N; CACCETTA, L; ANANCHUEN, W et al.Discrete mathematics. 2007, Vol 307, Num 1, pp 108-114, issn 0012-365X, 7 p.Article

Multicolored hamilton cycles and perfect matchings in pseudorandom graphsKUHN, Daniela; OSTHUS, Deryk.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 2, pp 273-286, issn 0895-4801, 14 p.Article

Valiant's Holant Theorem and matchgate tensorsCAI, Jin-Yi; CHOUDHARY, Vinay.Theoretical computer science. 2007, Vol 384, Num 1, pp 22-32, issn 0304-3975, 11 p.Conference Paper

Using graphs for some discrete tomography problemsCOSTA, M.-C; DE WERRA, D; PICOULEAU, C et al.Discrete applied mathematics. 2006, Vol 154, Num 1, pp 35-46, issn 0166-218X, 12 p.Article